A Trivariate Dichromate Polynomial for Digraphs
نویسندگان
چکیده
We define a trivariate polynomial combining the NL-coflow and NL-flow polynomial, which build dual pair counting acyclic colorings of directed graphs, in more general setting regular oriented matroids.
منابع مشابه
Trivariate C Polynomial Macro-Elements
Trivariate C macro-elements defined in terms of polynomials of degree 8r + 1 on tetrahedra are analyzed. For r = 1, 2, these spaces reduce to well-known macro-element spaces used in data fitting and in the finite-element method. We determine the dimension of these spaces, and describe stable local minimal determining sets and nodal minimal determining sets. We also show that the spaces approxim...
متن کاملTrivariate polynomial approximation on Lissajous curves ∗
We study Lissajous curves in the 3-cube that generate algebraic cubature formulas on a special family of rank-1 Chebyshev lattices. These formulas are used to construct trivariate hyperinterpolation polynomials via a single 1-d Fast Chebyshev Transform (by the Chebfun package), and to compute discrete extremal sets of Fekete and Leja type for trivariate polynomial interpolation. Applications co...
متن کاملOn polynomial digraphs
Let Φ(x, y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x, y) and the structure of G(Φ).
متن کاملA characteristic polynomial for rooted graphs and rooted digraphs
We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coe/cients and the degree of p(G; ). In particular, |p(G; 0)| is the number of acyclic orientations of G, while the degree of p(G; ) gives th...
متن کاملPolynomial Kernels for Deletion to Classes of Acyclic Digraphs
We consider the problem to find a set X of vertices (or arcs) with |X| ≤ k in a given digraph G such that D = G − X is an acyclic digraph. In its generality, this is Directed Feedback Vertex Set or Directed Feedback Arc Set respectively. The existence of a polynomial kernel for these problems is a notorious open problem in the field of kernelization, and little progress has been made. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_59